Zero-Entropy Minimization for Blind Extraction of Bounded Sources (BEBS)
نویسندگان
چکیده
Renyi’s entropy can be used as a cost function for blind source separation (BSS). Previous works have emphasized the advantage of setting Renyi’s exponent to a value different from one in the context of BSS. In this paper, we focus on zero-order Renyi’s entropy minimization for the blind extraction of bounded sources (BEBS). We point out the advantage of choosing the extended zero-order Renyi’s entropy as a cost function in the context of BEBS, when the sources have non-convex supports.
منابع مشابه
The Minimum Support Criterion for Blind Signal Extraction: A Limiting Case of the Strengthened Young's Inequality
In this paper, we address the problem of the blind extraction of a subset of “interesting” independent signals from a linear mixture. We present a novel criterion for the extraction of the sources whose density has the minimum support measure. By extending the definition of the Renyi’s entropies to include the zero-order case, this criterion can be regarded as part of a more general entropy min...
متن کاملBlind source separation based on endpoint estimation with application to the MLSP 2006 data competition
The problem of blind source separation is usually solved by optimizing a contrast function that measures either the independence of several variables or the non-gaussianity of a single variable. If the problem involves bounded sources, this knowledge can be exploited and the solution can be found with a customized contrast that relies on a simple endpoint estimator. The minimization of the leas...
متن کاملA Geometrical Algorithm for Blind Separation of Sources
The problem of blind separation of sources is generally solved by using statistical criteria, minimization of contrast function [2], [8], cancelation or minimization of a cost functions [6], [5], [4], [3]. However, using prior knowledge on the sources, new algorithms, basically simpler and more e cient, may be derived [9], [1], [7]. In this paper, assuming that sources have bounded probability ...
متن کاملLearning from Examples with Information Theoretic Criteria
This paper discusses a framework for learning based on information theoretic criteria. A novel algorithm based on Renyi’s quadratic entropy is used to train, directly from a data set, linear or nonlinear mappers for entropy maximization or minimization. We provide an intriguing analogy between the computation and an information potential measuring the interactions among the data samples. We als...
متن کاملComparison of entropy generation minimization principle and entransy theory in optimal design of thermal systems
In this study, the relationship among the concepts of entropy generation rate, entransy theory, and generalized thermal resistance to the optimal design of thermal systems is discussed. The equations of entropy and entransy rates are compared and their implications for optimization of conductive heat transfer are analyzed. The theoretical analyses show that based on entropy generation minimizat...
متن کامل